package com.example.leetcode.solution;

public class Solution11 {
    public static int maxArea(int[] height) {
        int area = 0;
        return area;
    }

    public static int s1(int[] height) {
        int maxArea = 0;
        for (int i = 0; i < height.length; i++) {
            for (int j = i + 1; j < height.length; j++) {
                int h = height[i] < height[j] ? height[i] : height[j];
                int w = j - i;
                int area = h * w;
                maxArea = maxArea < area ? area : maxArea;
            }
        }
        return maxArea;
    }

    public static int s2(int[] height) {
        int maxArea = 0;

        return maxArea;
    }
}
